package com.banmao.algorithm.No301To400.No344;

public class Solution1 {

    public void reverseString(char[] s) {

        int left = 0, right = s.length - 1;

        while (left < right) {
            char leftC = s[left];
            s[left] = s[right];
            s[right] = leftC;
            left++;
            right--;
        }

    }

}
